A bi-objective uncapacitated facility location problem
نویسندگان
چکیده
منابع مشابه
A Cultural Algorithm Applied in a Bi-Objective Uncapacitated Facility Location Problem
Cultural Algorithms (CAs) are one of the metaheuristics which can adapt in order to work in multi-objectives optimization environments. On the other hand, Bi-Objective Uncapacitated Facility Location Problem (BOUFLP) and particularly Uncapacitated Facility Location Problem (UFLP) are a well know problems in literature. However, a few articles have worked in the sense of applied evolutionary mul...
متن کاملUncapacitated Metric Facility Location Problem (umfl)
• Let L be a set of locations. • Let F ⊂ L be a set of potential facility locations. • Let C ⊂ L be a set of clients (cities). • Let c : L × L → R ∀i, j ∈ L be a distance function. Alternatively think of the function as describing the cost of assigning city j to facility i. • Let f : F → R ∀i ∈ F be a cost function describing the cost of opening a facility at i. • Let φ : C → F ∀j ∈ C be an ass...
متن کاملA hybrid multistart heuristic for the uncapacitated facility location problem
We present a multistart heuristic for the uncapacitated facility location problem, based on a very successful method we originally developed for the p-median problem. We show extensive empirical evidence to the effectiveness of our algorithm in practice. For most benchmarks instances in the literature, we obtain solutions that are either optimal or a fraction of a percentage point away from it....
متن کاملA 1.488 Approximation Algorithm for the Uncapacitated Facility Location Problem
We present a 1.488 approximation algorithm for the metric uncapacitated facility location (UFL) problem. The previous best algorithm was due to Byrka [1]. By linearly combining two algorithms A1(γf ) for γf = 1.6774 and the (1.11,1.78)-approximation algorithm A2 proposed by Jain, Mahdian and Saberi [8], Byrka gave a 1.5 approximation algorithm for the UFL problem. We show that if γf is randomly...
متن کاملLecture 4: Uncapacitated Facility Location
A Simple logarithmic approximation This problem can be formulated as a set cover problem. Given an instance (D,F, f, d) of the facility location problem, it can be transformed into an instance of a set cover problem (X,S, cost) by • setting X = D, and • setting S = {(i, A) : i ∈ F,A ⊆ D}. (i, A) covers elements of the set A. The cost of the set (i, A) is fi + ∑ j∈A dij . We can then use the sta...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 1997
ISSN: 0377-2217
DOI: 10.1016/s0377-2217(96)00168-3